Uniform Interpolation for퓐퓛퓒 Revisited
نویسندگان
چکیده
The notion of uniform interpolation for description logic ALC has been introduced in [9]. In this paper, we reformulate the uniform interpolation for ALC from the angle of forgetting and show that it satisfies all desired properties of forgetting. Then we introduce an algorithm for computing the result of forgetting in concept descriptions. We present a detailed proof for the correctness of our algorithm using the Tableau for ALC . Our results have been used to compute forgetting for ALC knowledge bases.
منابع مشابه
Uniform Interpolation for ALC Revisited
The notion of uniform interpolation for description logic ALC has been introduced in [9]. In this paper, we reformulate the uniform interpolation for ALC from the angle of forgetting and show that it satisfies all desired properties of forgetting. Then we introduce an algorithm for computing the result of forgetting in concept descriptions. We present a detailed proof for the correctness of our...
متن کاملForgetting for Answer Set Programs Revisited
A new semantic forgetting for answer set programs (ASP), called SM-forgetting, is proposed in the paper. It distinguishes itself from the others in that it preserves not only skeptical and credulous consequences on unforgotten variables, but also strong equivalence – forgetting same variables in strongly equivalent logic programs has strongly equivalent results. The forgetting presents a positi...
متن کاملAn Adaptation of a Root Finding Method to Searching Ordered Disk Files Revisited an Extensive Simulation Has Been Carried out on Ibm at with Turbo Pascal
In the present report, Interpolation search, Fast search and Pegasus method are compared with respect to their performance in searching ordered disk files for several key distributions. The aim is to study the effect of the page capacity on searching performance. Cost metric is the number of page accesses and not key comparisons. Numerical results are illustrated and a new approximate formula i...
متن کاملSOLVING LINEAR SIXTH-ORDER BOUNDARY VALUE PROBLEMS BY USING HYPERBOLIC UNIFORM SPLINE METHOD
In this paper, a numerical method is developed for solving a linear sixth order boundaryvalue problem (6VBP ) by using the hyperbolic uniform spline of order 3 (lower order). Thereis proved to be first-order convergent. Numerical results confirm the order of convergencepredicted by the analysis.
متن کاملUniform interpolation and the existence of sequent calculi
General conditions on sequent calculi are formulated under which the intermediate and modal logics corresponding to the calculi have uniform interpolation. It follows that the intuitionistic versions of K and KD, as well as several other intuitionistic modal logics, have uniform interpolation. It also follows that no intermediate or intuitionistic modal logic without uniform interpolation has a...
متن کامل